Exact generation of epsilon-efficient solutions in multiple objective programming

It is a common characteristic of many multiple objective programming problems that the efficient solution set can only be identified in approximation: since this set often contains an infinite number of points, only a discrete representation can be computed, and due to numerical difficulties, each of these points itself might in general be only approximate to some efficient point. From among the various approximation concepts, this paper considers the notion of epsilon-efficiency which has also been shown to be of relevance other than merely for the purpose to approximate solutions. Following preceding work by the same authors, new generating methods are proposed to resolve various drawbacks of those methods derived earlier. Supporting theoretical results are established and the methods demonstrated on an engineering design example.